tower of Hanoi puzzle

См. также в других словарях:

• Tower of Hanoi — The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Bramha) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly …   Wikipedia

• Puzzle — For other uses, see Puzzle (disambiguation). Puzzle solving redirects here. For the concept in Thomas Kuhn s philosophy of science, see normal science. Part of a series on Puzzles …   Wikipedia

• Mechanical puzzle — Part of a series on Puzzles …   Wikipedia

• List of puzzle topics — This is a list of puzzle topics, by Wikipedia page.See also: * List of impossible puzzles * List of puzzle based computer and video games * List of game topics.* Acrostic * Anagram * Back from the klondike * Burr puzzle * Chess problem * Chess… …   Wikipedia

• Mathematical puzzle — Mathematical puzzles make up an integral part of recreational mathematics. They have specific rules as do multiplayer games, but they do not usually involve competition between two or more players. Instead, to solve such a puzzle, the solver must …   Wikipedia

• Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

• Édouard Lucas — François Édouard Anatole Lucas (April 4, 1842 in Amiens October 3, 1891) was a French mathematician. Lucas is known for his study of the Fibonacci sequence. The related Lucas sequence is named after him. He gave a formula for finding the nth term …   Wikipedia

• Backup rotation scheme — A backup rotation scheme is a method for effectively backing up data where multiple media (such as tapes) are used in the backup process. The scheme determines how and when each piece of removable storage is used for a backup job and how long it… …   Wikipedia

• Baguenaudier — (also known as the Chinese Rings, Cardan s Suspension, Cardano s Rings, Devil s needle or five pillars puzzle) is a mechanical puzzle featuring a double loop of string which must be disentangled from a sequence of rings on interlinked pillars.… …   Wikipedia

• Implicit memory — is a type of memory in which previous experiences aid in the performance of a task without conscious awareness of these previous experiences.[1] Evidence for implicit memory arises in priming, a process whereby subjects show improved performance… …   Wikipedia

• Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… …   Wikipedia